A globally convergent BFGS method with nonmonotone line search for non-convex minimization

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A nonmonotone line search method for noisy minimization

is satisfied, where σ is the noise level. Alternatively, the algorithm terminates when the maximum number of 400 ·n function evaluations is exceeded. For each problem, a series of 50 independent runs are conducted. We considered a test run successful if the stopping criterium (1) is satisfied before exceeding the maximal number of function evaluations. To compare the performance of methods from...

متن کامل

Modified Limited Memory Bfgs Method with Nonmonotone Line Search for Unconstrained Optimization

In this paper, we propose two limited memory BFGS algorithms with a nonmonotone line search technique for unconstrained optimization problems. The global convergence of the given methods will be established under suitable conditions. Numerical results show that the presented algorithms are more competitive than the normal BFGS method.

متن کامل

Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization

Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms developed so far deal only with nonsmooth convex functions. In this paper, we propose a new algorithm for solving nonsmooth optimization problems that are not assumed to be convex. The algorithm combines the traditional c...

متن کامل

The BFGS method with exact line searches fails for non-convex objective functions

This work shows that the BFGS method and other methods in the Broyden class, with exact line searches, may fail for non-convex objective functions.

متن کامل

A Nonmonotone Line Search Method for Symmetric Nonlinear Equations

In this paper, we propose a new method which based on the nonmonotone line search technique for solving symmetric nonlinear equations. The method can ensure that the search direction is descent for the norm function. Under suitable conditions, the global convergence of the method is proved. Numerical results show that the presented method is practicable for the test problems.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2009

ISSN: 0377-0427

DOI: 10.1016/j.cam.2008.10.065